|
New algorithm for computing minerror linear complexity of p^n-periodic binary sequences
NIU Zhihua GUO Danfeng
Journal of Computer Applications
2013, 33 (01):
12-14.
DOI: 10.3724/SP.J.1087.2013.00012
The cost of a sequence must be calculated and stored in each step by using a classical k-error linear complexity algorithm. If only considering the first drop of its linear complexity namely the minerror linear complexity, a lot of calculation and memory space could be saved. A new algorithm for computing the minerror linear complexity of pn-periodic binary sequences was proposed in this paper. Here p is an odd prime, and 2 is a primitive root (module p2). The new algorithm eliminated the storage and computation of the cost of a sequence, focused on the method of calculation of the linear complexity when k was the minerror which made the first drop of its linear complexity. Besides, theoretical proof was given. Although the new algorithm saved more than half of the storage space and computation time, the results were totally same as the classical algorithm. It is an effective algorithm on the research of sequence's stability.
Reference |
Related Articles |
Metrics
|
|